An Algorithm for $L_\infty$ Approximation by Step Functions
نویسنده
چکیده
We give an algorithm for determining an optimal step function approximation of weighted data, where the error is measured with respect to the L∞ norm. The algorithm takes Θ(n+ log n · b(1 + log n/b)) time and Θ(n) space, where b is the number of steps. Thus the time is Θ(n log n) in the worst case and Θ(n) when b = O(n/ log n log log n). A minor change determines the optimal reduced isotonic regression in the same time and space bounds, and the algorithm also solves the k-center problem for 1-dimensional data.
منابع مشابه
An approximation to the solution of Benjamin-Bona-Mahony-Burgers equation
In this paper, numerical solution of the Benjamin-Bona-Mahony-Burgers (BBMB) equation is obtained by using the mesh-free method based on the collocation method with radial basis functions (RBFs). Stability analysis of the method is discussed. The method is applied to several examples and accuracy of the method is tested in terms of $L_2$ and $L_infty$ error norms.
متن کاملVerification of an Evolutionary-based Wavelet Neural Network Model for Nonlinear Function Approximation
Nonlinear function approximation is one of the most important tasks in system analysis and identification. Several models have been presented to achieve an accurate approximation on nonlinear mathematics functions. However, the majority of the models are specific to certain problems and systems. In this paper, an evolutionary-based wavelet neural network model is proposed for structure definiti...
متن کاملMinimizing a General Penalty Function on a Single Machine via Developing Approximation Algorithms and FPTASs
This paper addresses the Tardy/Lost penalty minimization on a single machine. According to this penalty criterion, if the tardiness of a job exceeds a predefined value, the job will be lost and penalized by a fixed value. Besides its application in real world problems, Tardy/Lost measure is a general form for popular objective functions like weighted tardiness, late work and tardiness with reje...
متن کاملOptimal Pareto Parametric Analysis of Two Dimensional Steady-State Heat Conduction Problems by MLPG Method
Numerical solutions obtained by the Meshless Local Petrov-Galerkin (MLPG) method are presented for two dimensional steady-state heat conduction problems. The MLPG method is a truly meshless approach, and neither the nodal connectivity nor the background mesh is required for solving the initial-boundary-value problem. The penalty method is adopted to efficiently enforce the essential boundary co...
متن کاملAn approximation algorithm and FPTAS for Tardy/Lost minimization with common due dates on a single machine
This paper addresses the Tardy/Lost penalty minimization with common due dates on a single machine. According to this performance measure, if the tardiness of a job exceeds a predefined value, the job will be lost and penalized by a fixed value. Initially, we present a 2-approximation algorithm and examine its worst case ratio bound. Then, a pseudo-polynomial dynamic programming algorithm is de...
متن کاملSIZE AND GEOMETRY OPTIMIZATION OF TRUSS STRUCTURES USING THE COMBINATION OF DNA COMPUTING ALGORITHM AND GENERALIZED CONVEX APPROXIMATION METHOD
In recent years, the optimization of truss structures has been considered due to their several applications and their simple structure and rapid analysis. DNA computing algorithm is a non-gradient-based method derived from numerical modeling of DNA-based computing performance by new computers with DNA memory known as molecular computers. DNA computing algorithm works based on collective intelli...
متن کامل